Thinning Out Redundant Empirical Data
نویسندگان
چکیده
Given a set X of “empirical” points, whose coordinates are perturbed by errors, we analyze whether it contains redundant information, that is whether some of its elements could be represented by a single equivalent point. If this is the case, the empirical information associated to X could be described by fewer points, chosen in a suitable way. We present two different methods to reduce the cardinality of X which compute a new set of points equivalent to the original one, that is representing the same empirical information. Though our algorithms use some basic notions of Cluster Analysis they are specifically designed for “thinning out” redundant data. We include some experimental results which illustrate the practical effectiveness of our methods.
منابع مشابه
An Improved Cost-Efficient Thinning Algorithm for Digital Image
Digital image processing plays an important role in our everevolving ubiquitous information society with an increasing need of automatic and efficient information collection. Thinning algorithms have been widely developed and applied in Optical Character Recognition (OCR) to eliminate the redundant data as well as keep the essential features of digital images. Inspired by the in-depth analysis ...
متن کاملMTBF evaluation for 2-out-of-3 redundant repairable systems with common cause and cascade failures considering fuzzy rates for failures and repair: a case study of a centrifugal water pumping system
In many cases, redundant systems are beset by both independent and dependent failures. Ignoring dependent variables in MTBF evaluation of redundant systems hastens the occurrence of failure, causing it to take place before the expected time, hence decreasing safety and creating irreversible damages. Common cause failure (CCF) and cascading failure are two varieties of dependent failures, both l...
متن کاملRule-Irredundancy and the Sequent Calculus for Core Logic
We explore the consequences, for logical system-building, of taking seriously (i) the aim of having irredundant rules of inference, and (ii) a preference for proofs of stronger results over proofs of weaker ones. This leads one to re-consider the structural rules of Reflexivity, Thinning and Cut. Reflexivity survives in the minimally necessary form φ : φ. Proofs have to get started. Cut is subj...
متن کاملCloud data modelling employing a unified, non-redundant triangular mesh
This paper describes an application of error-based triangulation to very large sets of three-dimensional (3D) data. The algorithm is suitable for processing data collected by machine vision systems, co-ordinate measuring machines or laser-based range sensors. The algorithm models the large data sets, termed cloud data, using a uni®ed, non-redundant triangular mesh. This is accomplished from the...
متن کاملBivariate binomial autoregressive models
This paper introduces new classes of bivariate time series models being useful to fit count data time series with a finite range of counts. Motivation comes mainly from the comparison of schemes for monitoring tourism demand, stock data, production and environmental processes. All models are based on the bivariate binomial distribution of Type II. First, a new family of bivariate integer-valued...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematics in Computer Science
دوره 1 شماره
صفحات -
تاریخ انتشار 2007